Properties of Finite Response Input Sequences of Recursive Convolutional Codes
نویسندگان
چکیده
A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response input sequences for recursive convolutional codes that give nite weight output sequences. In practice, we often need to describe the nite response sequence with a certain Hamming weight. Then, di erent properties of nite response input sequences are presented. It is shown that all nite response input sequences with a certain Hamming weight can be obtained in closed-form expressions from the so-called basic sequences. These basic sequences are presented for important recursive convolutional encoders and some possible applications are given .
منابع مشابه
A Class of _F-ary Convolutional Codes for Finite State 1S1 . Channels
ABSTRA CT— This paper presents F-ary convolutional codes for optimal decoding of pulse-amplitude-modulated (PAM) sequences over noisy finite intersymbol interference (1S1) channels. We refer to this new class of codes as ‘Optimal Convolutional Codes 9 (OCCS) for a channel in the sense of maximizing the minimum Euclidean Distance (ED), drni., between channel output sequences corresponding to dis...
متن کاملInput-state-output representations and constructions of finite support 2D convolutional codes
Two-dimensional convolutional codes are considered with code sequences having compact support indexed in N2 and taking values in Fn , where F is a finite field. Input-state-output representations of these codes are introduced and several aspects of such representations are discussed. Constructions of such codes with a designed distance are also presented.
متن کاملDuality of Channel Encoding and Decoding - Part I: Rate-1 Convolutional Codes
In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding process of rate-1 convolutional codes. From this we establish some interesting duality properties between encoding and decoding of rate-1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoder...
متن کاملA search for good convolutional codes to be used in the construction of turbo codes
Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error p...
متن کاملConvolutional Codes Over Rings
Elementary information about convolutional codes over finite fields is introduced, and various motivations for extension to convolutional codes over finite rings are discussed. The recent primary motivation is found to be for use over phase modulation signals. Such ring codes enjoy the special property of phase weight equal to phase distance equal to the squared Euclidean distance between phase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999